题目链接
https://leetcode.com/problems/move-zeroes/
题目原文
Given an array
nums
, write a function to move all0
’s to the end of it while maintaining the relative order of the non-zero elements.For example, given
nums = [0, 1, 0, 3, 12]
, after calling your function,nums
should be[1, 3, 12, 0, 0]
.Note:
1. You must do this in-place without making a copy of the array.
2. Minimize the total number of operations.
题目翻译
给定一个数组,写一个函数,将数组中的0都移动到数组末尾,同时保持非零数字的顺序。
比如,数组nums=[0, 1, 0, 3, 12]
,调用你的函数后,数组变成[1, 3, 12, 0, 0]
。
注意:
1. 你必须在原数组上进行修改,不能拷贝一个新数组;
2. 尽量减少你的操作次数。